Radix-4 Factorizations for the FFT with Ordered Input and Output

نویسندگان

  • Ritesh Vyas
  • Sandeep Goyat
  • Jitender Kumar
  • Sandeep Kaushal
چکیده

In this work we derive two families of radix-4 factorizations for the FFT (Fast Fourier Transform) that have the property that both inputs and outputs are addressed in natural order. These factorizations are obtained from another two families of radix-2 algorithms that have the same property. The radix-4 algorithms obtained have the same mathematical complexity (number of multiplications and additions) that Cooley-Tukey radix-4 algorithms but avoid de bit-reversal ordering applied to the input or at the output.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the convergence analysis of LMS adaptive filters with Gaussian data

1087 puts of each module in a special way to cause the output of the total algorithm to be in proper order 111, 191. This results in the fxtest algorithm, but the program must be written for a specific length. A fourth method is similar, but achieves the unscrambling by properly choosing the mulitplier constants in the modules [IO]. A program based on this method could transform many different ...

متن کامل

Analysis of Integral Nonlinearity in Radix-4 Pipelined Analog-to-Digital Converters

In this paper an analytic approach to estimate the nonlinearity of radix-4 pipelined analog-to-digital converters due to the circuit non-idealities is presented. Output voltage of each stage is modeled as sum of the ideal output voltage and non-ideal output voltage (error voltage), in which non-ideal output voltage is created by capacitor mismatch, comparator offset, input offset, and finite ga...

متن کامل

Design of Reconfigurable FFT Processor With Reduced Area And Power

Fast fourier transform (FFT) is an efficient implementation of the discrete fourier transform (DFT). The main objective of the project is to implement a reconfigurable FFT processor with reduced power and area in order to provide system designers and engineers with the flexibility to meet different system requirements. This paper proposes a low power and area efficient FFT architecture using Si...

متن کامل

A high-speed four-parallel radix-24 FFT/IFFT processor for UWB applications

In this paper, we present a novel high-speed lowcomplexity four data-path 128-point radix-2 FFT/IFFT processor for high-throughput MB-OFDM UWB systems. The high radix radix-2 multi-path delay feed-back (MDF) FFT architecture provides a higher throughput rate and low hardware complexity by using a four-parallel data-path scheme. A method for compensating the truncation error of fixed-width Booth...

متن کامل

Corrections to “ A General Theory of Phase Noise in Electrical Oscillators ”

The fast Fourier transform (FFT) processor of the above paper,1 contains many interesting and novel features. However, bit reversed input/output FFT algorithms, matrix transposers, and bit reversers have been noted in the literature. In addition, lower radix algorithms can be modified to be made computationally equivalent to higher radix algorithms. Many FFT ideas, including those of the above ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011